Asymptotics of Input-Constrained Erasure Channel
نویسندگان
چکیده
In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formulas of its mutual information rate; and for a binary erasure channel with its first-order Markovian input supported on the (1,∞)-RLL constraint, based on the concavity of its mutual information rate with respect to some parameterization of the input, we numerically evaluate its first-order Markov capacity and further derive its full asymptotics. The asymptotics result obtained in this paper, when compared with the recently derived feedback capacity for a binary erasure channel with the same input constraint, enable us to draw the conclusion that feedback may increase the capacity of an input-constrained channel, even if the channel is memoryless.
منابع مشابه
Input-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملThe Feedback Capacity of the $(1,\infty)$-RLL Input-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملAsymptotics of Input-Constrained Binary Symmetric Channel Capacity
We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117–122], we derive an asymptotic formula (when the noise parameter is small) for the ent...
متن کاملCapacity and reliability function for small peak signal constraints
The capacity and the reliability function as the peak constraint tends to zero are considered for a discrete-time memoryless channel with peak constrained inputs. Prelov and van der Meulen showed that under mild conditions the ratio of the capacity to the squared peak constraint converges to one-half the maximum eigenvalue of the Fisher information matrix and if the Fisher information matrix is...
متن کاملAalborg Universitet Sparse Packetized Predictive Control for Networked Control over Erasure Channels
We study feedback control over erasure channels with packet-dropouts. To achieve robustness with respect to packet-dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. To reduce the data size of packets, we propose to adopt sparsity-promoting optimizations, namely, `1-`2 and `2-constrained `0 optimizations, for which ...
متن کامل